A Theory for Abstract Reduction Systems in PVS
نویسندگان
چکیده
A theory for Abstract Reduction Systems (ARS) in the proof assistant PVS (Prototype Verification System) is described. Adequate specifications of basic definitions and notions such as reduction, confluence, normal form are given and well-known results proved, which includes non trivial ones such as Noetherian Induction, Newman’s Lemma and its generalizations, and Commutation Lemma among others. Although term rewriting proving technologies have been specified in several specification languages and proof assistants, to our knowledge this has not been done in PVS. This makes relevant our ARS specification as the initial step in the formulation of a complete theory for Term Rewriting Systems (TRS) in PVS.
منابع مشابه
A PVS Theory for Term Rewriting Systems
A theory, called trs, for Term Rewriting Systems in the theorem Prover PVS is described. This theory is built on the PVS libraries for finite sequences and sets and a previously developed PVS theory named ars for Abstract Reduction Systems which was built on the PVS libraries for sets. Theories for dealing with the structure of terms, for replacements and substitutions jointly with ars allow fo...
متن کاملVerification of Newman’s and Yokouchi’s Lemmas in PVS
This paper shows how a previously specified theory for Abstract Reduction Systems (ARSs) in which noetherianity was defined by the notion of wellfoundness over binary relations is used in order to prove results such as the wellknown Newman’s Lemma and the Yokouchi’s Lemma. The former one known as the diamond lemma and the later which states a property of commutation between ARSs. The ars theory...
متن کاملSystem Description : A Nuprl - PVS Connection : Integrating Libraries of Formal Mathematics ∗
∗ This work was supported by ONR Grant N00014-01-1-0765 (Building Interactive Digital Libraries of Formal Algorithmic Knowledge) and by NSF Grant CCR 0204193 (Proof Automation in Constructive Type Theory). Abstract. We describe a link between the Nuprl and PVS proof systems that enables users to access PVS from the Nuprl theorem proving environment, to import PVS theories into the Nuprl library...
متن کاملConstruction of Abstract State Graphs of Innnite Systems with Pvs
In this paper, we propose a method for the automatic construction of an abstract state graph of an innnite state system using the Pvs theorem prover. Given a system and a partition of the state space induced by predicates ' 1 ; :::; ' ` on the program variables which deenes an abstract state space, we construct an abstract state graph, starting in the abstract initial state. The possible succes...
متن کاملA New Approach for Knowledge Based Systems Reduction using Rough Sets Theory (RESEARCH NOTE)
Problem of knowledge analysis for decision support system is the most difficult task of information systems. This paper presents a new approach based on notions of mathematical theory of Rough Sets to solve this problem. Using these concepts a systematic approach has been developed to reduce the size of decision database and extract reduced rules set from vague and uncertain data. The method ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CLEI Electron. J.
دوره 11 شماره
صفحات -
تاریخ انتشار 2008